Path Clustering for Test Pattern Reduction of Variation-Aware Adaptive Path Delay Testing

In this study, a novel path clustering technique for adaptive path delay testing, where the test paths are altered according to the extracted device parameters, is proposed. The proposed algorithm is based on the k-means++ algorithm. By considering the probability function of the die-to-die systematic process variation, the proposed algorithm clusters path sets to minimize the total number of test paths. A figure of merit for clustering, which represents the expected number of test paths, is also proposed for quantitatively evaluating path clustering under different conditions. The proposed clustering method is evaluated numerically by applying it to the OpenCores benchmark circuit. Using our clustering technique, the average number of test paths in the adaptive test is reduced to less than 92 % compared with those in the conventional test. In addition, adaptive testing using the proposed technique can reduce the test patterns by 94.26 % while retaining the test quality. Responsible Editor: K.-J. Lee Michihiro Shintani [email protected] Takashi Sato [email protected] 1 Kyoto University, Yoshida-hon-machi, Sakyo, Kyoto, 606-8501, Japan 2 Gunma University, 1-5-1 Tenjin-cho, Kiryu, Gunma, 376-8515, Japan 3 Tokyo Institute of Technology, Nagatsuta 4259-S2-14, Midori-ku, Yokohama-shi, 226-8503, Japan